Compact Suux Array ?

Suux array is a data structure that can be used to index a large text le so that queries of its content can be answered quickly. Basically a suux array is an array of all suuxes of the text in the lexico-graphic order. Whether or not a word occurs in the text can be answered in logarithmic time by binary search over the suux array. In this work we present a method to compress a suux array such that the search time remains logarithmic. Our experiments show that in some cases a suux array can be compressed by our method such that the total space requirement is about half of the original.